A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs

A hypergraph is said to be oriented if each edge-vertex incidence has a label of +1 or −1. An called balanced there exists bipartition the vertex set such that every edge intersects one part in positively incident vertices with and other negatively edge. In this paper, we investigate balance hypergraphs induced signed by means eigenvalues associated matrices tensors provide spectral method characterize their hypergraphs.